Programme Committee

Programme Committee

The following theorem is proved: a formal language without the empty word is context-free if and only if it is generated by some L(\; p1)-grammar, where L(\; p1) is the Lambek calculus with one division and one primitive type. To do that, we use a substitution of types which reduces derivability in L(\) to derivability in L(\; p1).

CLEI 2006 Programme Committee

Code compression has been shown to be efficient in code size reduction and, recently, performance improvement and energy savings. In this paper we use a compression method, the ComPacket, which has selectively regions of the code to improve performance and complementary regions to sustain the code size reduction both at the same time. Using the leon (SPARC v8) platform and benchmarks from Media...

Constraint Propagation and Implementation Programme Committee Members of Programme Committee a Constraint Algebra

Many constraint toolkits provide logical connectives like disjunction, negation and implication that permit complex constraint expressions to be built from more primitive constraints. However, the propagation of complex constraints is typically delayed and so give little pruning. In this paper, we present a simple and light weight way to propagate such constraint expressions. We prove that comp...

Message from the programme committee chair

Welcome to the 5th International Symposium on Cluster Computing and the Grid (CCGrid 2005), being held in Cardiff, May 9-12, 2005. Cardiff is the capital city of Wales, and also has its centenary this year. It is therefore a particular pleasure to have you in this city at this time. This proceeding contains papers from the main track, the 9 different workshops being organised alongside CCGrid 2...

Proceedings of Ecai-96 Workshop: Empirical Ai Programme Committee